Computing f‐divergences and distances of high‐dimensional probability density functions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the distances between probability density functions

We give estimates of the distance between the densities of the laws of two functionals F and G on the Wiener space in terms of the Malliavin-Sobolev norm of F −G. We actually consider a more general framework which allows one to treat with similar (Malliavin type) methods functionals of a Poisson point measure (solutions of jump type stochastic equations). We use the above estimates in order to...

متن کامل

Distances between probability distributions via characteristic functions and biasing

In a spirit close to classical Stein’s method, we introduce a new technique to derive first order ODEs on differences of characteristic functions. Then, using concentration inequalities and Fourier transform tools, we convert this information into sharp bounds for the so-called smooth Wasserstein metrics which frequently arise in Stein’s method theory. Our methodolgy is particularly efficient w...

متن کامل

Estimating and Interpreting Probability Density Functions

This paper examines two approaches to estimating implied risk-neutral probability density functions from the prices of European-style options. It sets up a monte carlo test to evaluate alternative techniques’ ability to recover simulated distributions based on Heston’s (1993) stochastic volatility model. The paper tests both for the accuracy and stability of the estimated summary statistics fro...

متن کامل

Functional Models and Probability Density Functions

There exist many approaches to discern a functional relationship between two variables. A functional model is useful for two reasons: Firstly, if the function is a relatively simple model in the plane, it provides us with qualitative information about the relationship. Secondly, given a fixed value for one variable, the other one can be calculated as a means for prediction. In this paper an app...

متن کامل

Unsupervised Riemannian Clustering of Probability Density Functions

We present an algorithm for grouping families of probability density functions (pdfs). We exploit the fact that under the square-root re-parametrization, the space of pdfs forms a Riemannian manifold, namely the unit Hilbert sphere. An immediate consequence of this re-parametrization is that different families of pdfs form different submanifolds of the unit Hilbert sphere. Therefore, the proble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Linear Algebra With Applications

سال: 2022

ISSN: ['1070-5325', '1099-1506']

DOI: https://doi.org/10.1002/nla.2467